Graph coloring

Results: 948



#Item
61Spectral Graph Theory  Lecture 4 Courant-Fischer and Graph Coloring Daniel A. Spielman

Spectral Graph Theory Lecture 4 Courant-Fischer and Graph Coloring Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2012-08-24 09:50:05
62L(p, q) Labeling of d-Dimensional Grids∗ Guillaume Fertin1 , Andr´e Raspaud2 1 LINA FRE CNRS 2729, Universit´e de Nantes

L(p, q) Labeling of d-Dimensional Grids∗ Guillaume Fertin1 , Andr´e Raspaud2 1 LINA FRE CNRS 2729, Universit´e de Nantes

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:57:12
63Spectral Graph Theory  Lecture 4 Bounding Eigenvalues Daniel A. Spielman

Spectral Graph Theory Lecture 4 Bounding Eigenvalues Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-09-22 14:35:18
64The adaptable choosability number grows with the choosability number Michael Molloya,1 , Giovanna Throna a  University of Toronto, Department of Computer Science, 10 King’s College Road,

The adaptable choosability number grows with the choosability number Michael Molloya,1 , Giovanna Throna a University of Toronto, Department of Computer Science, 10 King’s College Road,

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-09-09 12:41:59
65An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy∗ George B. Mertzios† Abstract Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree o

An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy∗ George B. Mertzios† Abstract Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree o

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2012-12-29 10:50:56
666.006 Homework Problem Set 4, Part A INSERT NAME HERE Collaborators: INSERT COLLABORATORS HERE  # 1 – Cycles

6.006 Homework Problem Set 4, Part A INSERT NAME HERE Collaborators: INSERT COLLABORATORS HERE # 1 – Cycles

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-04-05 16:32:35
67(4, 2)-choosability of planar graphs with forbidden structures  1 4

(4, 2)-choosability of planar graphs with forbidden structures 1 4

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2016-07-07 18:45:25
68Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1

Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2011-07-20 16:50:25
69JanuaryBuilding Excitement and Success for Young Children Kessler Elementary School Ms. Debbie Morgan, Principal

JanuaryBuilding Excitement and Success for Young Children Kessler Elementary School Ms. Debbie Morgan, Principal

Add to Reading List

Source URL: www.longview.k12.wa.us

Language: English - Date: 2016-01-06 23:01:55
70Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer  Computer Engineering and

Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer Computer Engineering and

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:24